Overview
The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress.
The 32nd International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2022) will be held as a hybrid (blended) meeting, both in-person (at the Ivane Javakhishvili Tbilisi State University -TSU- in Tbilisi, Georgia) and virtual. Previous symposia were held in Tallin (hybrid event), Bologna (as a virtual meeting), Porto, Frankfurt am Main, Namur, Edinburgh, Siena, Canterbury, Madrid, Leuven, Odense, Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve and Manchester. You might have a look at the contents of past LOPSTR symposia at DBLP, and at the Springer LNCS repository for past Post-proceedings.
LOPSTR 2022 will be co-located with PPDP 2022 as part of the Computational Logic Autumn Summit 2022. Information about venue and travel is available on the CLAS 2022 website.
The LOPSTR 2022 proceedings will be published by Springer in the Lecture Notes in Computer Science series at conference time after a single round of reviewing.
Submissions can be made in two categories: full papers and extended abstracts. All submissions must be written in English. Submissions of Full Papers must describe original work, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Submissions of Extended Abstracts may describe work-in-progress research to be presented during the conference. These contributions will be published in informal proceedings, if enough papers are accepted.
After the symposium, a selection of the best papers will be invited for submission to a special issue of the Fundamenta Informaticae journal. Authors of selected original papers will be invited to revise and/or extend their submissions to be considered for publication in the special issue. The papers submitted to the special issue will be subject to the standard reviewing process of the journal.
Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large, including, but not limited to:
- synthesis; transformation; specialization; composition; optimisation
- specification; analysis; verification; testing; certification
- program and model manipulation; inversion
- artificial intelligence methods for program development; verification and testing of AI-based systems
- transformational techniques in SE
- applications and tools
Both full papers and extended abstracts describing foundations and applications in these areas are welcome. Survey papers that present some aspects of the above topics from a new perspective and papers that describe experience with industrial applications are also welcome.
Program & Schedule
All times are in Georgia Standard Time (GST) which is GMT+4.
LOPSTR Room: 212 (First Floor).
Shared invited talks will be in Room 202 (PPDP Room)
| Wednesday, September 21 | |
|---|---|
| 9:00 - 10:30 |
INVITED TALK (PPDP+LOPSTR) -- Room 202 (PPDP)
Automated Termination and Complexity Analysis. Florian Zuleger |
| 10:30 - 22:00 | CLAS social events. |
| Thursday, September 22 | |
|---|---|
| 9:00 - 10:30 |
INVITED TALK (PPDP+LOPSTR) -- Room 202 (PPDP)
Refinement Types from Light to Deep Verification. Niki Vazou |
| 10:30 - 11:00 | Coffee Break |
| 11:00 - 12:30 |
Session I
|
| 12:30 - 14:00 | Lunch Break |
| 14:00 - 15:30 |
Session II
|
| 15:30 - 16:00 | Coffee Break |
| 16:00 - 17:30 |
Session III
|
| Friday, September 23 | |
|---|---|
| 9:00 - 10:00 | CLAS talk -- Room 107.
Hierarchical Higher-Order Port-graph Rewriting as a Modelling Tool. Maribel Fernandez |
| 10:30 - 11:00 | Coffee Break |
| 11:00 - 12:30 |
INVITED TALK
Systematic testing for robotic systems. Robert Hierons |
| 12:30 - 14:00 | Lunch Break |
| 14:00 - 15:30 |
Session IV
|
| 15:30 - 16:00 | Coffee Break |
Invited Speakers
| Robert Hierons, The University of Sheffield, UK. (LOPSTR invited speaker) |
| Title: Systematic testing for robotic systems |
|
Abtract:
Robotic systems form the basis for advances in areas such as manufacturing, healthcare, and transport. A number of areas in which robotic systems are being used are safety-critical and so there is a need for software development processes that lead to robotic systems that are safe, reliable and trusted. Testing will inevitably be an important component.
This talk will describe recent work on automated testing of robotic systems. The work is model-based: it takes as input a state-based model that describes the required behaviour of the system under test. Models are written in either RoboChart, a state-based language for robotics, or RoboSim, a simulation language for robotics. These languages have been given a formal semantics, making it possible to reason about models in a sound manner. This talk will describe how the development of robotic software can be formalised based on such languages and how this can lead to the potential to automate the generation of sound test cases. Such test cases can be used for testing within a simulation and possibly also for testing the deployed system. Testing is systematic since test cases target potential faults. |
| Niki Vazou, IMDEA Software Institute, Spain (joint PPDP-LOPSTR invited speaker) |
| Title: Refinement Types from Light to Deep Verification |
|
Abtract:
Refinement types decorate the types of a programming language with logical predicates to allow more expressive type specifications. Originally, refinement type based specifications were restricted to SMT decidable theories and allowed automatic “light” verification, for example properties like non-division by zero or in-bound indexing. Verification of such light properties though requires "deeper" specifications, for example "is append associative?" or even "does your language preserve typing?"
In this talk, I will present an overview of refinement types and using Liquid Haskell as the prototype refinement type implementation, will present various examples that cover both light and deep refinement type-based verification. |
| Florian Zuleger, Technische Universität Wien, Austria (joint PPDP-LOPSTR invited speaker) |
| Title: Automated Termination and Complexity Analysis |
| Abtract: In this talk, I will overview two techniques that are suitable for automated termination and computational complexity analysis. 1) We are interested in abstract program models for which we are able to obtain decidability and expressivity results. Such program models can be used as backends in automated analyzers. I will present results on the size-change abstraction (SCA), which maintains only inequalities between sizes on the program state, and on vector addition systems with states (VASS), which are an equivalent representation of Petri nets with finite state. 2) Building on a line of previous work, I will present an approach based on potential function templates with unknown coefficients. The analysis is stated as a type-and-effect system where the typing rules generate constraints over the unknown coefficients. Our work targets the performance analysis of self-adjusting data structures such as (randomized) splay trees, which requires sophisticated potential functions that include logarithmic expressions. |
Accepted papers
- Your Blockchain Needn’t Care How the Message is Spread. Wolfgang Jeltsch and Javier Díaz.
- Building a Join-Optimizer for Soufflé. Samuel Arch, Xiaowen Hu, David Zhao, Pavle Subotić and Bernhard Scholz.
- From Infinity to Choreographies: Extraction for Unbounded Systems. Bjørn Angel Kjær, Luís Cruz-Filipe and Fabrizio Montesi.
- Analysing Parallel Complexity of Term Rewriting. Thaïs Baudon, Carsten Fuhs and Laure Gonnord.
- Towards Clause Learning a la Carte through VarMonads. Arved Friedemann and Oliver Keszocze.
- Typed SLD Resolution: Dynamic Typing for Logic Programming. João Barbosa, Mário Florido and Vitor Santos-Costa.
- On correctness of normal logic programs. Włodzimierz Drabent.
- Model Checking Meets Auto-Tuning High-Performance Programs. Natalia Garanina, Sergey Staroletov and Sergei Gorlatch.
- Random Testing of Constrained Recursive Types. Ghiles Ziat, Vincent Botbol, Matthieu Dien, Arnaud Gotlieb, Martin Pépin and Catherine Dubois.
- Automating UAV Flight Readiness Approval using Goal-Directed Answer Set Programming. Sarat Chandra Varanasi, Baoluo Meng, Christopher Alexander, Szabolcs Borgyos and Brendan Hall.
- Confluence Framework: Proving Confluence with CONFident. Raúl Gutiérrez, Miguel Vítores and Salvador Lucas.
- Variant-based equational anti-unification. María Alpuente, Demis Ballis, Santiago Escobar and Julia Sapiña
Important dates (AoE)
Important dates:
- Abstract submission:
May 2, 2022May 16, 2022 - Paper submission:
May 9, 2022May 23, 2022 - Notification to authors:
June 20, 2022June 24, 2022 - Final version: July 11, 2022
- Conference: September 21-23, 2022
Call for papers
Submission Guidelines
Authors should submit an electronic copy of the paper (written in English) in PDF, formatted in the Lecture Notes in Computer Science style. Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords which will be used to assist the PC in selecting appropriate reviewers for the paper. Authors should consult Springer's authors' instructions at the author's page, and use their proceedings templates, either for LaTeX (available also in Overleaf) or for Word, for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. In addition, upon acceptance, the corresponding author of each paper, acting on behalf of all of the authors of that paper, must complete and sign a Consent-to-Publish form. The corresponding author signing the copyright form should match the corresponding author marked on the paper. Once the files have been sent to Springer, changes relating to the authorship of the papers cannot be made.
Page numbers (and, if possible, line numbers) should appear on the manuscript to help the reviewers in writing their report. So, for LaTeX, we recommend that authors use:
\pagestyle{plain}
\usepackage{lineno}
\linenumbers
Full papers cannot exceed 15 pages excluding references. Extended abstracts cannot exceed 8 pages excluding references. Additional pages may be used for appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them.
Papers should be submitted via EasyChair: https://easychair.org/conferences/?conf=lopstr2022
Accepted full papers will be published in the formal LNCS proceedings. The PC can also invite up to two papers for rapid publication in the journal of Theory and Practice of Logic Programming (TPLP). Accepted extended abstracts will be included in the informal proceedings if enough papers are accepted. The program committee may recommend some full papers to be accepted only for presentation at the symposium and to be included in the informal proceedings.
Best Paper Award and Prize
Thanks to Springer's sponsorship, a best paper award, which will include a 1000 EUR prize, will be given at LOPSTR 2022. The program committee will select the winning paper based on relevance, originality and technical quality but may also take authorship into account (e.g. a student paper).
Committees
| Program Committee | |
| Elvira Albert | Complutense University of Madrid, Spain |
| Roberto Amadini | University of Bologna, Italy |
| Emanuele De Angelis | National Research Council, Italy |
| Włodzimierz Drabent | IPI PAN, Poland & Linköping University, Sweden |
| Catherine Dubois | ENSIIE-Samovar, France |
| Fabio Fioravanti | University of Chieti-Pescara, Italy |
| Gopal Gupta | University of Texas at Dallas, USA |
| Geoff Hamilton | Dublin City University, Ireland |
| Michael Hanus | Kiel University, Germany |
| Maja Kirkeby | Roskilde University, Denmark |
| Ekaterina Komendantskaya | Heriot-Watt University, UK |
| Temur Kutsia | RISC J. Kepler University of Linz, Austria |
| Maria Chiara Meo | University G. D'Annunzio, Chieti Pescara, Italy |
| Fred Mesnard | Université de la Réunion, France |
| Alberto Momigliano | University of Milano, Italy |
| Naoki Nishida | Nagoya University, Japan |
| Laura Panizo | University of Málaga, Spain |
| Laura Titolo | National Institute of Aerospace, US |
| Wim Vanhoof | University of Namur, Belgium |
| Alicia Villanueva (Chair) | Universitat Politècnica de València, Spain |
| Organizing Committee Chair | |
| Besik Dundua | Tbilisi State University / Kutaisi International University, Georgia |
Contact Us
PC Chair
Alicia Villanueva
VRAIN - Universitat Politècnica de València, Spain
Conference Chair
Besik Dundua
Tbilisi State University / Kutaisi International University, Georgia
In Cooperation with
